Recent advances on two-dimensional bin packing problems

نویسندگان

  • Andrea Lodi
  • Silvano Martello
  • Daniele Vigo
چکیده

We survey recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and e1ective heuristic and metaheuristic approaches. ? 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

 Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...

متن کامل

بررسی تعدادی از روشهای آماری جهت ترسیم نمودار کنترل مشاهدات انفرادی برای فرایندهای اتورگرسیو

  Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fu...

متن کامل

روشی جدید برای چیدمان قطعات مستطیل شکل در یک فضای مستطیل شکل

 Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fun...

متن کامل

Invited Review Two-dimensional packing problems: A survey

We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems these units are finite rectangles, and the objective is to pack all the items into the minimum number of units, while in two-dimensional strip packing problems there is a single standardized unit of given width, and the o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 123  شماره 

صفحات  -

تاریخ انتشار 2002